On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations
نویسندگان
چکیده
We extend the notion of regular sequence ([Mac16]) to overdetermined system of algebraic equations. We study generic properties of Gröbner bases and analyse precisely the behavior of the F5 [Fau02] algorithm. Sharp asymptotic estimates of the degree of regularity are given. We consider polynomials (f1, . . . , fm) in k[x1, . . . , xn] where k is a field. In this extended abstract, we restrict attention to homogeneous polynomials. We denote by di the total degree of f
منابع مشابه
Approximate Gröbner Bases and Overdetermined Algebraic Systems
We discuss computation of Gröbner bases using approximate arithmetic for coefficients. We show how certain considerations of tolerance, corresponding roughly to accuracy and precision from numeric computation, allow us to obtain good approximate solutions to problems that are overdetermined. We provide examples of solving overdetermined systems of polynomial equations. As a secondary feature we...
متن کاملÉtude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie
Gröbner bases constitute an important tool for solving algebraic systems of equations, and their computation is often the hard part of the resolution. This thesis is devoted to the complexity analysis of Gröbner basis computations for overdetermined algebraic systems (the number m of equations is greater than the number n of variables). In the generic (”random”) case, tools exist to analyze the...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملAnalytical and Verified Numerical Results Concerning Interval Continuous-time Algebraic Riccati Equations
This paper focuses on studying the interval continuous-time algebraic Riccati equation A∗X + XA + Q − XGX = 0, both from the theoretical aspects and the computational ones. In theoretical parts, we show that Shary’s results for interval linear systems can only be partially generalized to this interval Riccati matrix equation. We then derive an efficient technique for enclosing the united stable...
متن کاملIFS Coding of Non-Homogeneous Fractal Images Using Gröbner Basis Techniques
This paper proposes a moment based encoding algorithm for iterated function system (IFS) coding of nonhomogeneous fractal images with unequal probabilities. Moment based encoding algorithms for IFS coding of non-homogeneous fractal images require a solution of simultaneous algebraic equations that are difficult to handle with numerical root-finding methods. The proposed algorithm employs a vari...
متن کامل